Heavy-traffic limits for a single-server queue leading up to a critical point

نویسنده

  • Ward Whitt
چکیده

We establish heavy-traffic limits for the arrival and workload processes in a single-server queue with a time-varying arrival-rate function. We establish limits at and before a critical point, the onset of critical loading, where the arrival-rate function approaches its critical value from below. We extend results by Newell (1968) and Mandelbaum and Massey (1995) and present alternative views of the interesting scaling constants that arise in these limits.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single Server Bulk Queue with Service Interruption, Two Phase Repairs and State Dependent Rates

This paper reports a study on a single server queue with bulk arrival and bulk service patterns wherein the incoming traffic depends on the state of the server which may be in operating or breakdown state. The repair of the breakdown server is performed in two phases. The operating duration of server, repair duration of both phases of repairing as well as job's inter-arrival times and service t...

متن کامل

Heavy-Traffic Limits for Loss Proportions in Single-Server Queues

We establish heavy-traffic stochastic-process limits for the queue-length and overflow stochastic processes in the standard single-server queue with finite waiting room (G/G/1/K). We show that, under regularity conditions, the content and overflow processes in related single-server models with finite waiting room, such as the finite dam, satisfy the same heavy-traffic stochastic-process limits....

متن کامل

Diffusion Limits for Shortest Remaining Processing Time Queues

We present a heavy traffic analysis for a single server queue with renewal arrivals and generally distributed i.i.d. service times, in which the server employs the Shortest Remaining Processing Time (SRPT) policy. Under typical heavy traffic assumptions, we prove a diffusion limit theorem for a measure-valued state descriptor, from which we conclude a similar theorem for the queue length proces...

متن کامل

On the Nonsymmetric Longer Queue Model: Joint Distribution, Asymptotic Properties, and Heavy Traffic Limits

We consider two parallel queues, each with independent Poisson arrival rates, that are tended by a single server. The exponential server devotes all of its capacity to the longer of the queues. If both queues are of equal length, the server devotes ] of its capacity to the first queue and the remaining 1 − ] to the second. We obtain exact integral representations for the joint probability distr...

متن کامل

Heavy Traffic Limits for Unobservable Queues with Clearing Times

In many service systems, customers may choose to abandon the system if their wait is deemed excessive. In an observable queue, the server is always aware that an abandoning customer has left the queue. However, in unobservable queues, the fact that the customer has abandoned the system may be unbeknownst to the server. Not only are the abandoning customers unobservable to the server, the server...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Oper. Res. Lett.

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2016